Maximal irredundant families of minimal size in the alternating group
نویسندگان
چکیده
منابع مشابه
Groups With Maximal Irredundant Covers And Minimal Blocking Sets
Let n be a positive integer. Denote by PG(n, q) the n-dimensional projective space over the finite field Fq of order q. A blocking set in PG(n, q) is a set of points that has non-empty intersection with every hyperplane of PG(n, q). A blocking set is called minimal if none of its proper subsets are blocking sets. In this note we prove that if PG(ni, q) contains a minimal blocking set of size ki...
متن کاملIrredundant Families of Subcubes
We consider the problem of finding the maximum possible size of a family of k-dimensional subcubes of the n-cube {0, 1}n, none of which is contained in the union of the others. (We call such a family ‘irredundant’). Aharoni and Holzman [1] conjectured that for k > n/2, the answer is ( n k ) (which is attained by the family of all k-subcubes containing a fixed point). We give a new proof of a ge...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولthe effect of the record infancy in crimilly acts of guilties (in karaj city)
چکیده یکی از مهمترین دغدغه های بزرگ جوامع بشری، از دیر باز تا کنون که ذهن پژوهشگران و متخصصان بهداشت روانی و اجتماعی و دولتها رابه خود مشغول داشته، مسأله ی بزهکاری می باشد. شناخت کامل پدیده ی بزهکاری و بزهکار، علل وعوامل سقوط یک انسان، چگونگی درمان وی و درنهایت پیشگیری ازبزهکاری ودریک کلام سالم سازی یک جامعه، رسالت عظیم، انسانی ومقدسی می باشد که با بررسی شخصیت مجرم یعنی[ انسانی که تحت شرای...
15 صفحه اولThe complexity of irredundant sets parameterized by size
An irredundant set of vertices V ′ ⊆ V in a graph G = (V,E) has the property that for every vertex u ∈ V ′, N(V ′ − {u}) is a proper subset of N(V ′). We investigate the parameterized complexity of determining whether a graph has an irredundant set of size k, where k is the parameter. The interest of this problem is that while most “k-element vertex set” problems are NP-complete, several are kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 2019
ISSN: 0003-889X,1420-8938
DOI: 10.1007/s00013-019-01331-8